#include <bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define ll long long
const int N = 2e5 + 5;
const ll MOD = 1e9 + 7;
void solve()
{
ll n;
cin >> n;
string s;
cin >> s;
ll cnt = 0, yes = 0;
for (int i = 0; i < n; i++)
{
if (s[i] == '.')cnt++;
if (i <= n - 3)
{
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')yes = 1;
}
}
if (yes)cout << "2\n";
else cout << cnt << '\n';
return;
}
int main()
{
IO
int t = 1;
cin >> t;
while (t--)
{
solve();
}
return 0;
}
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |